The smallest positive integer that is solution of a proportionally modular Diophantine inequality
نویسندگان
چکیده
منابع مشابه
Proportionally Modular Diophantine Inequalities and Full Semigroups
A proportionally modular numerical semigroup is the set of nonnegative integer solutions to a Diophantine inequality of the type axmod b ≤ cx . We give a new presentation for these semigroups and we relate them with a type of affine full semigroups. Next, we describe explicitly the minimal generating system for the affine full semigroups we are considering. As a consequence, we obtain generatin...
متن کاملProportionally modular diophantine inequalities and the Stern-Brocot tree
Given positive integers a, b and c to compute a generating system for the numerical semigroup whose elements are all positive integer solutions of the inequality axmod b ≤ cx is equivalent to computing a Bézout sequence connecting two reduced fractions. We prove that a proper Bézout sequence is completely determined by its ends and we give an algorithm to compute the unique proper Bézout sequen...
متن کاملOn the Frobenius Number of a Modular Diophantine Inequality
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality ax mod b 6 x, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
متن کاملOne Diophantine inequality with integer and prime variables
*Correspondence: [email protected] 2Department of Mathematics and Information Science, Henan University of Economics and Law, Zhengzhou, 450046, P.R. China Full list of author information is available at the end of the article Abstract In this paper, we show that if λ1, λ2, λ3, λ4 are positive real numbers, at least one of the ratios λi/λj (1≤ i < j≤ 4) is irrational, then the inequality |λ1x2 1 +...
متن کاملThe Smallest Solutions to the Diophantine Equation
In this paper we discuss a method used to find the smallest nontrivial positive integer solutions to a1 + a 6 2 = b 6 1 + b 6 2 + b 6 3 + b 6 4 + b 6 5. The method, which is an improvement over a simple brute force approach, can be applied to search the solution to similar equations involving sixth, eighth and tenth powers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Inequalities & Applications
سال: 2008
ISSN: 1331-4343
DOI: 10.7153/mia-11-14